The Anchor-Robust Project Scheduling Problem

نویسندگان

چکیده

In project scheduling, the durations of activities are often uncertain. Delays may cause a massive disorganization if large number must be rescheduled. “The Anchor-Robust Project Scheduling Problem,” Bendotti, Chrétienne, Fouilhoux, and Pass-Lanneau propose novel criterion for solution stability in scheduling under processing times uncertainty. They define anchored jobs as whose starting can guaranteed baseline schedule. Finding schedule with bounded makespan max-weight set anchors is shown to an NP-hard robust two-stage problem. Taking advantage combinatorial structure budgeted uncertainty, authors obtain compact MIP formulation Numerical results show that obtained outperforms standard techniques from literature. also showcase practical interest scheduling.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Exact Algorithm for the Mode Identity Project Scheduling Problem

In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...

متن کامل

The Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem

This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practica...

متن کامل

Robust Solutions for the Resource-Constrained Project Scheduling Problem

Robustness is essential for schedules if they are being executed under uncertain conditions. In this thesis we research robustness in Partial Order Schedules, which represent sets of solutions for instances of the Resource-Constrained Project Scheduling Problem. They can be generated using a greedy procedure called Chaining, which can be easily adapted to use various heuristics. We use an empir...

متن کامل

Developing Robust Project Scheduling Methods for Uncertain Parameters

A common problem arising in project management is the fact that the baseline schedule is often disrupted during the project execution because of uncertain parameters. As a result, project managers are often unable to meet the deadline time of the milestones. Robust project scheduling is an effective approach in case of uncertainty. Upon adopting this approach, schedules are protected against po...

متن کامل

an exact algorithm for the mode identity project scheduling problem

in this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (mrcpsp) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. we present a depth-first branch and bound algorithm for the resource constrained project schedulin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research

سال: 2022

ISSN: ['1526-5463', '0030-364X']

DOI: https://doi.org/10.1287/opre.2022.2315